On Oscillation-free ε-random Sequences II

نویسندگان

  • Jöran Mielke
  • Ludwig Staiger
  • L. Staiger
چکیده

It has been shown (see [10]), that there are strongly MARTIN-LÖFε-random ω-words that behave in terms of complexity like random ωwords. That is, in particular, the a priori complexity of these ε-random ω-words is bounded from below and above by linear functions with the same slope ε. In this paper we will study the set of these ω-words in terms of HAUSDORFF measure and dimension. Additionally we find upper bounds on a priori complexity, monotone and simple complexity for a certain class of ω-power languages.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Oscillation-free ε-random Sequences

In this paper we discuss three notions of partial randomness or ε-randomness. ε-randomness should display all features of randomness in a scaled down manner. However, as Reimann and Stephan [15] proved, Tadaki [22] and Calude et al. [3] proposed at least three different concepts of partial randomness. We show that all of them satisfy the natural requirement that any ε-non-null set contains an ε...

متن کامل

On Oscillation-Free Chaitin h-Random Sequences

The present paper generalises results by Tadaki [12] and Calude et al. [1] on oscillation-free partially random infinite strings. Moreover, it shows that oscillation-free partial Chaitin randomness can be separated from oscillation-free partial strong Martin-Löf randomness by Π 1 -definable sets of infinite strings. In the papers [11] and [2] several relaxations of randomness were defined. Subs...

متن کامل

Random Walks with Look-Ahead in Scale-Free Random Graphs

If m ≥ 2 is constant and 0 ≤ r ≤ ε log log n for a small positive constant ε, then whp a random walk with look-ahead r on a scale-free graph G = G(m,n) has cover time CG(r) ∼ (2/(mr−1(m − 1))) n log n.

متن کامل

Random Attractors for Stochastic Retarded Lattice Dynamical Systems

and Applied Analysis 3 It is worth mentioning that in the absence of the white noise, the existence of a global attractor for 1.3 1.4 was established in 40 . The main contribution of this paper is to extend the method of tail estimates to stochastic retarded LDSs and prove the existence of a random attractor for the infinite dimensional random dynamical system generated by stochastic retarded L...

متن کامل

Generalization of a theorem of Erdos and Rényi on Sidon sequences

Erdős and Rényi claimed and Vu proved that for all h ≥ 2 and for all ε > 0, there exists g = gh(ε) and a sequence of integers A such that the number of ordered representations of any number as a sum of h elements of A is bounded by g, and such that |A ∩ [1, x]| À x1/h−ε. We give two new proofs of this result. The first one consists of an explicit construction of such a sequence. The second one ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009